package com.lyz.dataStructure.algorithm.腾讯面试2020;/**
 * @Author:759057893@qq.com Lyz
 * @Date: ${Date} 21:23
 * @Description:
 **/

import java.util.Scanner;

/**
 *@Author:759057893@qq.com Lyz
 *@Date: 2019/9/1 21:23
 *@Description:
 **/
public class 排队 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n =sc.nextInt();
        int ans = 0, x;
/*        for(int i = 0; i < n; i++){
            for(int j = 0; j < 2; j++){
                x = sc.nextInt();
                ans += x;
            }
        }*/

        int b = 0;
        for(int i = 0; i < n; i++){
            for(int j = 0; j < 2; j++){

            }
        }
        System.out.println();
    }
}

/*
#include "bits/stdc++.h"

using namespace std;
const int mod = 1e9 + 7;
struct node
{
    long long a,b;
    bool friend operator < (node a,node b)
    {
        return a.a-a.b>b.a-b.b;
    }
}a[100004];
int main() {
    long long n;
    scanf("%lld",&n);
    for (int i = 0; i < n; ++i) {
        scanf("%lld%lld",&a[i].a,&a[i].b);
    }
    sort(a,a+n);
    long long ans=0;
    for (int i = 0; i < n; ++i) {
        ans+=(a[i].a-a[i].b)*(i+1)-a[i].a+a[i].b*n;
    }
    printf("%lld\n",ans);
}
 */
